3 research outputs found
A HYBRID ALGORITHM FOR THE UNCERTAIN INVERSE p-MEDIAN LOCATION PROBLEM
In this paper, we investigate the inverse p-median location problem with variable edge lengths and variable vertex weights on networks in which the vertex weights and modification costs are the independent uncertain variables. We propose a model for the uncertain inverse p-median location problem with tail value at risk objective. Then, we show that it is NP-hard. Therefore, a hybrid particle swarm optimization algorithm is presented to obtain the approximate optimal solution of the proposed model. The algorithm contains expected value simulation and tail value at risk simulation
A SOLUTION ALGORITHM FOR p-MEDIAN LOCATION PROBLEM ON UNCERTAIN RANDOM NETWORKS
This paper investigatesthe classical -median location problem in a network in which some of the vertex weights and the distances between vertices are uncertain and while others are random. For solving the -median problem in an uncertain random network, an optimization model based on the chance theory is proposed first and then an algorithm is presented to find the -median. Finally, a numerical example is given to illustrate the efficiency of the proposed metho